On permutations of order dividing a given integer

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On permutations of order dividing a given integer

We give a detailed analysis of the proportion of elements in the symmetric group on n points whose order divides m, for n sufficiently large and m ≥ n with m=O(n).

متن کامل

On a Problem of Arnold: the Average Multiplicative Order of a given Integer

For g, n coprime integers, let `g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of `g(n) as n ≤ x ranges over integers coprime to g, and x tending to infinity. Assuming the Generalized Riemann Hypothesis, we show that this average is essentially as large as the average of the Carmichael lambda function. We also determine the asymptot...

متن کامل

On the Number of Permutations Avoiding a Given Pattern

Let σ ∈ Sk and τ ∈ Sn be permutations. We say τ contains σ if there exist 1 ≤ x1 < x2 < . . . < xk ≤ n such that τ(xi) < τ(xj) if and only if σ(i) < σ(j). If τ does not contain σ we say τ avoids σ. Let F (n, σ) = |{τ ∈ Sn| τ avoids σ}|. Stanley and Wilf conjectured that for any σ ∈ Sk there exists a constant c = c(σ) such that F (n, σ) ≤ cn for all n. Here we prove the following weaker statemen...

متن کامل

Permutations with given peak set

Let Sn denote the symmetric group of all permutations π = a1 . . . an of {1, . . . , n}. An index i is a peak of π if ai−1 < ai > ai+1 and we let P (π) be the set of peaks of π. Given any set S of positive integers we define P (S;n) to be the set π ∈ Sn with P (π) = S. Our main result is that for all fixed subsets of positive integers S and all sufficiently large n we have #P (S;n) = p(n)2n−#S−...

متن کامل

A Stream Cipher Based on Chaotic Permutations

In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2007

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-007-0056-5